Vérifier les protocoles cryptographiques

نویسنده

  • Véronique Cortier
چکیده

A cryptographic protocol is a description of message exchanges on a network. The verification of such programs has become crucial. We propose here a synthesis of decidability and undecidability results for secrecy and authentication properties. We consider several restrictions: bound on the number of sessions, on the size of messages, on the number of copies at each transition, etc. Moreover, we describe which tools may be used to verify the protocols. MOTS-CLÉS : protocoles cryptographiques, sécurité, secret, authentification.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Théories de l'intrus pour la vérification des protocoles cryptographiques. (Intruder theories for the verification of cryptographic protocols)

Je remercie aussi les différentes personnes qui ont soutenu (et soutiennent encore !) la vie du campus de l'École, parfois au détriment de leur scolarité, en s'investissant dans les associations et les clubs animant les soirées et les weekends : (par ordre alphabétique, j'espère ne pas avoir oublié trop de monde ou du moins, de ne pas avoir oublié de personnes ran-m'ont permis d'apprécier les a...

متن کامل

Constraints-based Verification of Parameterized Cryptographic Protocols

Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. Although many works have been dedicated to standard protocols like Needham-Schroder very few address the more challenging class of group protocols. We present a synchronous model for group protocols, that generalizes st...

متن کامل

On the Reachability Problem in Cryptographic Protocols

We study the veri cation of secrecy and authenticity properties for cryptographic protocols which rely on symmetric shared keys. The veri cation can be reduced to check whether a certain parallel program which models the protocol and the speci cation can reach an erroneous state while interacting with the environment. Assuming nite principals, we present a simple decision procedure for the reac...

متن کامل

Abstractions pour la vérification de propriétés de sécurité de protocoles cryptographiques. (Abstractions for verification of security properties of cryptographic protocols)

ions pour la vérification de propriétés de sécurité de protocoles cryptographiques Soutenue le 19 septembre 2003 Composition du jury : – Michel Bidoit Directeur de thèse – Paul Gastin Président du jury – Jean Goubault-Larrecq Examinateur – Francis Klay Examinateur – Yassine Lakhnech Rapporteur – Jean-François Raskin Rapporteur

متن کامل

Thomas Genet , Francis Klay N ̊ ? ? ? ?

On a case study, we present a new approach for verifying cryptographic protocols, based on rewriting and on tree automata techniques. Protocols are operationally described using Term Rewriting Systems and the initial set of communication requests is described by a tree automaton. Starting from these two representations, we automatically compute an over-approximation of the set of exchanged mess...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Technique et Science Informatiques

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2005